Finding Non-local Dependencies: Beyond Pattern Matching

نویسنده

  • Valentin Jijkoun
چکیده

We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for phrase structure trees is extended with machine learning techniques. The algorithm is essentially a classifier that predicts a nonlocal dependency given a connected fragment of a dependency structure and a set of structural features for this fragment. Evaluating the algorithm on the Penn Treebank shows an improvement of both precision and recall, compared to the results presented in (Johnson, 2002).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching

Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...

متن کامل

Minimality beyond Lexical Restrictions: Processing and Acquisition of Free Wh-dependencies in European Portuguese

The Generalized Minimality approach to comprehension difficulties with non-local dependencies (Grillo 2005, 2008) predicts that in non-local dependencies (e.g. object relatives) a partial match in internal structure between the moved and the intervening DP can generate a minimality effect and lead to comprehension difficulties in several populations, including children and agrammatic Broca's ap...

متن کامل

Linear Pattern Matching with Swaps for Short Patterns

The Pattern Matching problem with swaps is a variation of the classical pattern matching problem. It consists of finding all the occurrences of a pattern P in a text T , when an unrestricted number of disjoint local swaps is allowed. In this paper, we present a new, efficient method for the Swap Matching problem with short patterns. In particular, we present an algorithm constructing a non-dete...

متن کامل

Data Mining: Heuristics in Fuzzy Pattern Matching

Fuzzy pattern matching technique represents a group of fuzzy methods for supervised fuzzy pattern recognition. It has a number of advantages over other pattern recognition methods, including simpler methods of attribute selection or ability to learn in real time environments. These methods build a prototype for each attribute and combine the partial estimations of each prototype by a fusion ope...

متن کامل

Swap Matching in Strings by Simulating Reactive Automata

The pattern matching problem with swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In this paper we introduce a new theoretical approach to the problem based on a reactive automaton modeled after the pattern, and provide two efficient non standard simulations of the automaton, based on bit-parallelism. The first simulat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003